Characterizing operations preserving separability measures via linear preserver problems
نویسندگان
چکیده
منابع مشابه
Linear Preserver Problems
Linear preserver problems is an active research area in matrix and operator theory. These problems involve certain linear operators on spaces of matrices or operators. We give a general introduction to the subject in this article. In the first three sections, we discuss motivation, results, and problems. In the last three sections, we describe some techniques, outline a few proofs, and discuss ...
متن کاملSome General Techniques on Linear Preserver Problems
Several general techniques on linear preserver problems are described. The first one is based on a transfer principle in Model Theoretic Algebra that allows one to extend linear preserver results on complex matrices to matrices over other algebraically closed fields of characteristic 0. The second one concerns the use of some simple geometric technique to reduce linear preserver problems to sta...
متن کاملSome Linear Preserver Problems on B(h) concerning Rank and Corank
As a continuation of the work on linear maps between operator algebras which preserve certain subsets of operators with finite rank, or finite corank, here we consider the problem inbetween, that is, we treat the question of preserving operators with infinite rank and infinite corank. Since, as it turns out, in this generality our preservers cannot be written in a nice form what we have got use...
متن کاملLinear maps preserving or strongly preserving majorization on matrices
For $A,Bin M_{nm},$ we say that $A$ is left matrix majorized (resp. left matrix submajorized) by $B$ and write $Aprec_{ell}B$ (resp. $Aprec_{ell s}B$), if $A=RB$ for some $ntimes n$ row stochastic (resp. row substochastic) matrix $R.$ Moreover, we define the relation $sim_{ell s} $ on $M_{nm}$ as follows: $Asim_{ell s} B$ if $Aprec_{ell s} Bprec_{ell s} A.$ This paper characterizes all linear p...
متن کاملPrivacy-preserving linear and nonlinear approximation via linear programming
We propose a novel privacy-preserving random kernel approximation based on a data matrix A ∈ R whose rows are divided into privately owned blocks. Each block of rows belongs to a different entity that is unwilling to share its rows or make them public. We wish to obtain an accurate function approximation for a given y ∈ Rm corresponding to each of the m rows of A. Our approximation of y is a re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear and Multilinear Algebra
سال: 2011
ISSN: 0308-1087,1563-5139
DOI: 10.1080/03081087.2011.596540